/*
 * This file is part of Tornado: A heterogeneous programming framework:
 * https://github.com/beehive-lab/tornadovm
 *
 * Copyright (c) 2013-2020, APT Group, Department of Computer Science,
 * The University of Manchester. All rights reserved.
 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
 *
 * This code is free software; you can redistribute it and/or modify it
 * under the terms of the GNU General Public License version 2 only, as
 * published by the Free Software Foundation.
 *
 * This code is distributed in the hope that it will be useful, but WITHOUT
 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
 * version 2 for more details (a copy is included in the LICENSE file that
 * accompanied this code).
 *
 * You should have received a copy of the GNU General Public License version
 * 2 along with this work; if not, write to the Free Software Foundation,
 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
 *
 */
package uk.ac.manchester.tornado.runtime.graph.nodes;

import java.util.ArrayList;
import java.util.Collections;
import java.util.List;

public abstract class AbstractNode implements Comparable<AbstractNode> {

    protected int index;

    protected int id;

    protected final List<AbstractNode> uses;

    public AbstractNode() {
        id = -1;
        uses = new ArrayList<>();
    }

    public boolean hasInputs() {
        return false;
    }

    public List<AbstractNode> getInputs() {
        return Collections.emptyList();
    }

    public void addUse(AbstractNode use) {
        if (!uses.contains(use)) {
            uses.add(use);
        }
    }

    public int getIndex() {
        return index;
    }

    @Override
    public int compareTo(AbstractNode o) {
        if (o == null) {
            return -1;
        }

        return (this == o) ? 0 : 1;
    }

    public int getId() {
        return id;
    }

    public List<AbstractNode> getUses() {
        return uses;
    }

    public void replaceAtUses(AbstractNode toReplace, AbstractNode replacement) {
        uses.remove(toReplace);
        uses.add(replacement);
    }

    public void setId(int value) {
        id = value;
    }

    @Override
    public String toString() {
        return String.format("[%d]: %s", id, this.getClass().getSimpleName());
    }
}
